Efficient Loop Conditions for Bounded Model Checking Hyperproperties

Abstract Bounded model checking (BMC) is an effective technique for hunting bugs by incrementally exploring the state space of a system. To reason about infinite traces through finite structure and to ultimately obtain completeness, BMC incorporates loop conditions that revisit previously observed states. This paper focuses on developing – temporal logic hyperproperties allows expressing important policies security consistency in concurrent systems, etc. Loop are more complicated than , as different may inconsistently unrelated moments. Existing approaches only considered linear unrollings without any looping capability, which precludes both finding small obtaining complete technique. We investigate BMC, formulas contain up one quantifier alternation. first present general automata-based based bounds maximum unrollings. Then, we introduce alternative simulation-based algorithms allow exploiting short loops effectively, generating SAT queries whose satisfiability guarantees outcome original problem. also report empirical evaluation prototype implementation our techniques using .